On k-partite hypergraphs with the induced ε-density property
نویسنده
چکیده
In this paper we extend the study of bipartite graphs with the induced ε-density property introduced by Frankl, Rödl, and the author. For a given kpartite k-uniform hypergraph G we say that a k-partite k-uniform hypergraph R = (W1, . . . ,Wk,F) has the induced ε-density property if every subhypergraph ofR with at least ε|F| edges contains a copy of G which is an induced subhypergraph of R. We show that for every ε > 0 and positive integers k and n there exists a k-partite k-uniform hypergraph R with the induced ε-density property for every G = (V1, . . . , Vk, E) with |V1|, . . . , |Vk| ≤ n. We give several proofs of this result, some of which allow for the hypergraph R to be taken with at most 22 cnk−1 vertices.
منابع مشابه
The counting lemma for regular k-uniform hypergraphs
Szemerédi’s Regularity Lemma proved to be a powerful tool in the area of extremal graph theory. Many of its applications are based on its accompanying Counting Lemma: If G is an `-partite graph with V (G) = V1 ∪ · · · ∪ V` and |Vi| = n for all i ∈ [`], and all pairs (Vi, Vj) are ε-regular of density d for 1 ≤ i < j ≤ ` and ε d, then G contains (1± f`(ε))d “ ` 2 ” × n` cliques K`, where f`(ε) → ...
متن کاملOn the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex cover is polynomial time solvable. In this work, we study the natural extension of bipartite vertex cover to hypergraphs, namely finding a small vertex cover in kuniform k-partite hypergraphs, when the k-partition is gi...
متن کاملDensity and regularity theorems for semi-algebraic hypergraphs
A k-uniform semi-algebraic hypergraph H is a pair (P,E), where P is a subset of R and E is a collection of k-tuples {p1, . . . , pk} ⊂ P such that (p1, . . . , pk) ∈ E if and only if the kd coordinates of the pi-s satisfy a boolean combination of a finite number of polynomial inequalities. The complexity of H can be measured by the number and the degrees of these inequalities and the number of ...
متن کاملRamsey Properties of Random k-Partite, k-Uniform Hypergraphs
We investigate the threshold probability for the property that every r-coloring of the edges of a random binomial k-uniform hypergraph G(k)(n, p) yields a monochromatic copy of some fixed hypergraph G. In this paper we solve the problem for arbitrary k ≥ 3 and k-partite, k-uniform hypergraphs G.
متن کاملInapproximability of Minimum Vertex Cover on k-Uniform k-Partite Hypergraphs
We study the problem of computing the minimum vertex cover on k-uniform k-partite hypergraphs when the k-partition is given. On bipartite graphs (k = 2), the minimum vertex cover can be computed in polynomial time. For k ≥ 3, this problem is known to be NP-hard. For general k, the problem was studied by Lovász [23], who gave a k2 -approximation based on the standard LP relaxation. Subsequent wo...
متن کامل